1

Approximating Node-Deletion Problems for Matroidal Properties

Year:
1999
Language:
english
File:
PDF, 134 KB
english, 1999
2

A unified approximation algorithm for node-deletion problems

Year:
1998
Language:
english
File:
PDF, 1.18 MB
english, 1998
3

A primal-dual method for approximating tree cover with two weights

Year:
2006
Language:
english
File:
PDF, 283 KB
english, 2006
4

A Primal-Dual Method for Approximating Tree Cover with Two Weights

Year:
2004
Language:
english
File:
PDF, 169 KB
english, 2004
5

A 2-approximation NC algorithm for connected vertex cover and tree cover

Year:
2004
Language:
english
File:
PDF, 149 KB
english, 2004
6

On approximability of the independent/connected edge dominating set problems

Year:
2001
Language:
english
File:
PDF, 88 KB
english, 2001
8

On approximation of the submodular set cover problem

Year:
1999
Language:
english
File:
PDF, 118 KB
english, 1999
9

Approximating minimum feedback vertex sets in hypergraphs

Year:
2000
Language:
english
File:
PDF, 102 KB
english, 2000
12

A modified greedy algorithm for dispersively weighted 3-set cover

Year:
2006
Language:
english
File:
PDF, 215 KB
english, 2006
14

How to guard a graph against tree moves

Year:
2013
Language:
english
File:
PDF, 179 KB
english, 2013
18

Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications

Year:
2016
Language:
english
File:
PDF, 170 KB
english, 2016
20

How to trim a MST

Year:
2012
Language:
english
File:
PDF, 129 KB
english, 2012
24

Online Weight Balancing on the Unit Circle

Year:
2016
Language:
english
File:
PDF, 379 KB
english, 2016